10. Tables
10.1 Data Types
# &# &# &# &#
Name &Item &Header &Library &Page
array &—— &array.h &libL.a &21
array2 &—— &array.h &libL.a &23
b_priority_queue &b_pq_item &b_prio.h &libL.a &41
b_queue &—— &b_queue.h &libL.a &27
b_stack &—— &b_stack.h &libL.a &26
bool &—— &basic.h &libL.a &15
circle &—— &plane.h &libP.a &85
cmd_istream &—— &stream.h &libL.a &110
cmd_ostream &—— &stream.h &libL.a &110
d2_dictionary &d2_dic_item &d2_dictionary.h &libP.a &88
d_array &—— &d_array.h &libL.a &44
dictionary &dic_item &dictionary.h &libL.a &42
edge_array &—— &graph.h &libG.a &65
edge_set &—— &edge_set.h &libG.a &68
file_istream &—— &stream.h &libL.a &109
file_ostream &—— &stream.h &libL.a &109
graph &node/edge &graph.h &libG.a &53
GRAPH &node/edge &graph.h &libG.a &61
h_array &—— &h_array.h &libL.a &46
int_set &—— &int_set.h &libL.a &34
interval_set &is_item &interval_set.h &libP.a &92
line &—— &plane.h &libP.a &82
list &list_item &list.h &libL.a &28
matrix &—— &matrix.h &libL.a &19
node_array &—— &graph.h &libG.a &65
node_matrix &—— &graph.h &libG.a &67
node_partition &—— &node_partition.h &libG.a &69
node_pq &—— &node_pq.h &libG.a &70
node_set &—— &node_set.h &libG.a &68
panel &—— &window.h &libP.a/libWx.a &106
partition &partition_item &partition.h &libL.a &35
planar_map &node/edge/face &planar_map.h &libG.a &59
point &—— &plane.h &libP.a &79
point_set &ps_item &point_set.h &libP.a &90
polygon &—— &plane.h &libP.a &84
priority_queue &pq_item &prio.h &libP.a &39
p_dictionary &p_dic_item &p_dictionary.h &libL.a &50
PLANAR_MAP &node/edge/face &planar_map.h &libG.a &64
queue &—— &queue.h &libL.a &25
segment &—— &plane.h &libP.a &80
segment_set &seg_item &segment_set.h &libP.a &94
set &—— &set.h &libL.a &33
sortseq &seq_item &sortseq.h &libL.a &47
stack &—— &stack.h &libL.a &24
string &—— &basic.h &libL.a &15
string_istream &—— &stream.h &libL.a &111
string_ostream &—— &stream.h &libL.a &111
subdivision &node/face &subdivision.h &libP.a &96
tree_collection &d_vertex &tree_collection.h&libL.a &36
ugraph &node/edge &ugraph.h &libG.a &57
UGRAPH &node/edge &ugraph.h &libG.a &63
vector &—— &vector.h &libL.a &17
window &—— &window.h &libP.a/libWx.a &97
10.2 Algorithms
# &# &# &#
Name &Header &Library &Page
ALL_PAIRS_SHORTEST_PATHS &graph_alg.h &libG.a &73
BELLMAN_FORD &graph_alg.h &libG.a &73
BFS &graph_alg.h &libG.a &72
COMPONENTS &graph_alg.h &libG.a &72
CONVEX_HULL &plane_alg.h &libP.a &87
DFS &graph_alg.h &libG.a &71
DFS_NUM &graph_alg.h &libG.a &71
DIJKSTRA &graph_alg.h &libG.a &73
MAX_CARD_MATCHING &graph_alg.h &libG.a &74
MAX_CARD_BIPARTITE_MATCHING &graph_alg.h &libG.a &74
MAX_FLOW &graph_alg.h &libG.a &74
MAX_WEIGHT_BIPARTITE_MATCHING &graph_alg.h &libG.a &75
MIN_SPANNING_TREE &graph_alg.h &libG.a &75
PLANAR &graph_alg.h &libG.a &76
SEGMENT_INTERSECTION &plane_alg.h &libP.a &87
SPANNING_TREE &graph_alg.h &libG.a &75
STRAIGHT_LINE_EMBEDDING &graph_alg.h &libG.a &76
STRONG_COMPONENTS &graph_alg.h &libG.a &72
TOPSORT &graph_alg.h &libG.a &71
TRANSITIVE_CLOSURE &graph_alg.h &libG.a &72
TRIANGULATE_PLANAR_MAP &graph_alg.h &libG.a &76
VORONOI &plane_alg.h &libP.a &87
10cm